Homogeneous variable exponent Besov and Triebel–Lizorkin spaces

We introduce homogeneous Besov and Triebel–Lizorkin spaces with variable indexes. We show that their study reduces to the study of inhomogeneous variable exponent spaces and homogeneous constant exponent spaces. Corollaries include trace space characterizations and Sobolev embeddings.     

On weak–strong uniqueness for the compressible Navier–Stokes system with non-monotone pressure law

We show the weak–strong uniqueness property for the compressible Navier–Stokes system with general non-monotone pressure law. A weak solution coincides with the strong solution emanating from the same initial data as long as the latter solution exists.     

A survey on book-embedding of planar graphs

The book-embedding problem arises in several area, such as very large scale integration (VLSI) design and routing multilayer printed circuit boards (PCBs). It can be used into various practical application fields. A book embedding of a graph G is an embedding of its vertices along the spine of a book, and an embedding of its edges to the pages such that edges embedded on the same page do not intersect. The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G. It is an important measure of the quality for book-embedding. It is NP-hard to research the pagenumber of book-embedding for a graph G. This paper summarizes the studies on the book-embedding of planar graphs in recent years.     

The coupled-cluster formalism – a mathematical perspective

ABSTRACT

The Coupled-Cluster (CC) theory is one of the most successful high precision methods used to solve the stationary Schrödinger equation. In this article, we address the mathematical foundation of this theory with focus on the advances made in the past decade. Rather than solely relying on spectral gap assumptions (non-degeneracy of the ground state), we highlight the importance of coercivity assumptions – Gårding type inequalities – for the local uniqueness of the CC solution. Based on local strong monotonicity, different sufficient conditions for a local unique solution are suggested. One of the criteria assumes the relative smallness of the total cluster amplitudes (after possibly removing the single amplitudes) compared to the Gårding constants. In the extended CC theory the Lagrange multipliers are wave function parameters and, by means of the bivariational principle, we here derive a connection between the exact cluster amplitudes and the Lagrange multipliers. This relation might prove useful when determining the quality of a CC solution. Furthermore, the use of an Aubin–Nitsche duality type method in different CC approaches is discussed and contrasted with the bivariational principle.     

Regularized gap functions and error bounds for split mixed vector quasivariational inequality problems

In this paper, we consider a class of split mixed vector quasivariational inequality problems in real Hilbert spaces and establish new gap functions by using the method of the nonlinear scalarization function. Further, we obtain some error bounds for the underlying split mixed vector quasivariational inequality problems in terms of regularized gap functions. Finally, we give some examples to illustrate our results. The results obtained in this paper are new.     

Strong Convergence Theorems for Mixed Typ e Asymptotically Nonexpansive Mappings

The purpose of this paper is to study a new two-step iterative scheme with mean errors of mixed type for two asymptotically nonexpansive self-mappings and two asymptotically nonexpansive nonself-mappin...     

Strong cliques in vertex-transitive graphs

A clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique $C$ in a vertex-transitive graph $\mathrm{\Gamma }$ is strong if and only if $\text{◂=▸}\text{◂⋅▸}\mid C\mid \mid I\mid =\mid V\left(\mathrm{\Gamma }\right)\mid$ for every maximal independent set $I$ of $\mathrm{\Gamma }$. On the basis of this result we prove that a vertex-transitive graph is CIS if and only if it admits a strong clique and a strong independent set. We classify all vertex-transitive graphs of valency at most 4 admitting a strong clique, and give a partial characterization of 5-valent vertex-transitive graphs admitting a strong clique. Our results imply that every vertex-transitive graph of valency at most 5 that admits a strong clique is localizable. We answer an open question by providing an example of a vertex-transitive CIS graph which is not localizable.